An Iterated Projection Approach to Variational Problems Under Generalized Convexity Constraints
نویسندگان
چکیده
منابع مشابه
Weak efficiency in multiobjective variational problems under generalized convexity
In this paper, we provide new pseudoinvexity conditions on the involved functionals of amultiobjective variational problem, such that all vector Kuhn-Tucker or Fritz John points are weakly efficient solutions if and only if these conditions are fulfilled. We relate weakly efficient solutions to optimal solutions of weighting problems. We improve recent papers, and we generalize pseudoinvexity c...
متن کاملHandling Convexity-Like Constraints in Variational Problems
We provide a general framework to construct finite-dimensional approximations of the space of convex functions, which also applies to the space of c-convex functions and to the space of support functions of convex bodies. We give precise estimates of the distance between the approximation space and the admissible set. This framework applies to the approximation of convex functions by piecewise-...
متن کاملA numerical approach to variational problems subject to convexity constraint
We describe an algorithm to approximate the minimizer of an elliptic functional in the form ∫ Ω j(x, u,∇u) on the setC of convex functions u in an appropriate functional spaceX . Such problems arise for instance in mathematical economics [4]. A special case gives the convex envelope u∗∗ 0 of a given function u0. Let (Tn) be any quasiuniform sequence of meshes whose diameter goes to zero, and In...
متن کاملNumerical Approach to the Estimation of Solutions of some Variational Problems with Convexity Constraints ∗
We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivator behind this numerical method is estimating solutions to Adverse Selection problems within a Principal-Agent framework. Problems such as product lines design, optimal taxation, structured derivatives design, etc. can be studied through th...
متن کاملConvexity Properties of Inverse Problems with Variational Constraints
When an inverse problem can be formulated so the data are minima of one of the variational problems of mathematical physics, feasibility constraints can be found for the nonlinear inversion problem. These constraints guarantee that optimal solutions of the inverse problem lie in the convex feasible region of the model space. Furthermore, points on the boundary of this convex region can be found...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Optimization
سال: 2016
ISSN: 0095-4616,1432-0606
DOI: 10.1007/s00245-016-9361-5